The number of nowhere-zero flows on graphs and signed graphs

The existence of an integral flow polynomial that counts nowhere-zero k-flows on a graph, due to Kochol, is a consequence of a general theory of inside-out polytopes. The same holds for flows on signed graphs. We develop these theories, as well as the related counting theory of nowhere-zero flows on a signed graph with values in an abelian group of odd order. Our results are of two kinds: polynomiality or quasipolynomiality of the flow counting functions, and reciprocity laws that interpret the evaluations of the flow polynomials at negative integers in terms of the combinatorics of the graph. Note to publisher: This paper does NOT have a “corresponding author” or “senior author”. All authors are EQUAL. All authors are able to answer correspondence from readers. For editorial purposes ONLY, contact the writer of the cover letter of submission.